Course contents: Solving problems with search agents. Searching strategies: breadth-first search, uniformcost search, depth-first search, depth-limited search, iterative deepening depth-first search, bi-directional search. Heuristic functions: greedy best-first search, A*-search. Local search. Constraint satisfaction problems. Agents for knowledge representation and reasoning. Propositional and first order logics. Knowledge base design. Reasoning systems: modus ponens, unification, forward and backward chaining, resolution. Introduction to logic programming and Prolog.

Assessment: Written exercises and implementation of a project during semester and written exams at the end of the semester. The final grade results in by taking into account the respective marks of exercises (10-20%), project (30-40%) and final examination (50-80%).